Search results for "Dissimilarity measure"
showing 3 items of 3 documents
Comparing pollen spectra from modified Tauber traps and moss samples: examples from a selection of woodlands across Europe
2010
This paper compares pollen spectra derived from modified Tauber traps and moss samples from a selection of woodland types from Bulgaria, the Czech Republic, Georgia, Greece, Poland, Switzerland and Wales. The study examines the representation of individual taxa in the two sampling media and aims to ascertain the duration of pollen deposition captured by a moss. The latter aim was pursued through the calculation of dissimilarity indexes to assess how many years of pollen deposited in a pollen trap yield percentage values that are most similar to those obtained from the moss. The results are broadly scattered; the majority of moss samples being most similar to several years of pollen depositi…
A New Dissimilarity Measure for Clustering Seismic Signals
2011
Hypocenter and focal mechanism of an earthquake can be determined by the analysis of signals, named waveforms, related to the wave field produced and recorded by a seismic network. Assuming that waveform similarity implies the similarity of focal parameters, the analysis of those signals characterized by very similar shapes can be used to give important details about the physical phenomena which have generated an earthquake. Recent works have shown the effectiveness of cross-correlation and/or cross-spectral dissimilarities to identify clusters of seismic events. In this work we propose a new dissimilarity measure between seismic signals whose reliability has been tested on real seismic dat…
Shape matching, shape retrieval
2016
This thesis concerns shape matching and shape retrieval. It describes four contributions to thisdomain. The first is an improvement of the k-means method, in order to find the best partition ofvoxels inside a given shape ; these best partitions permit to match shapes using an optimal matchingin a bipartite graph. The second contribution is the fusion of two descriptors, one local, the otherglobal, with the product rule. The third contribution considers the complete graph, the vertices ofwhich are the shapes in the database and the query. Edges are labelled with several distances,one per descriptor. Then the method computes, with linear programming, the convex combinationof distances which m…